Computer architecture evaluation for structural dynamics computations: Project summary

The intent of the proposed effort is the examination of the impact of the elements of parallel architectures on the performance realized in a parallel computation. To this end, three major projects are developed: a language for the expression of high level parallelism, a statistical technique for the synthesis of multicomputer interconnection networks based upon performance prediction, and a queueing model for the analysis of shared memory hierarchies

Adapting high-level language programs for parallel processing using data flow

EASY-FLOW, a very high-level data flow language, is introduced for the purpose of adapting programs written in a conventional high-level language to a parallel environment. The level of parallelism provided is of the large-grained variety in which parallel activities take place between subprograms or processes. A program written in EASY-FLOW is a set of subprogram calls as units, structured by iteration, branching, and distribution constructs. A data flow graph may be deduced from an EASY-FLOW program

Modeling and synthesis of multicomputer interconnection networks

The type of interconnection network employed has a profound effect on the performance of a multicomputer and multiprocessor design. Adequate models are needed to aid in the design and development of interconnection networks. A novel modeling approach using statistical and optimization techniques is described. This method represents an attempt to compare diverse interconnection network designs in a way that allows not only the best of existing designs to be identified but to suggest other, perhaps hybrid, networks that may offer better performance. Stepwise linear regression is used to develop a polynomial surface representation of performance in a (k+1) space with a total of k quantitative and qualitative independent variables describing graph-theoretic characteristics such as size, average degree, diameter, radius, girth, node-connectivity, edge-connectivity, minimum dominating set size, and maximum number of prime node and edge cutsets. Dependent variables used to measure performance are average message delay and the ratio of message completion rate to network connection cost. Response Surface Methodology (RSM) optimizes a response variable from a polynomial function of several independent variables. Steepest ascent path may also be used to approach optimum points

Efficient partitioning and assignment on programs for multiprocessor execution

The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions

A taxonomic backbone for the global synthesis of species diversity in the angiosperm order Caryophyllales

The Caryophyllales constitute a major lineage of flowering plants with approximately 12500 species in 39 families. A taxonomic backbone at the genus level is provided that reflects the current state of knowledge and accepts 749 genera for the order. A detailed review of the literature of the past two decades shows that enormous progress has been made in understanding overall phylogenetic relationships in Caryophyllales. The process of re-circumscribing families in order to be monophyletic appears to be largely complete and has led to the recognition of eight new families (Anacampserotaceae, Kewaceae, Limeaceae, Lophiocarpaceae, Macarthuriaceae, Microteaceae, Montiaceae and Talinaceae), while the phylogenetic evaluation of generic concepts is still well underway. As a result of this, the number of genera has increased by more than ten percent in comparison to the last complete treatments in the Families and genera of vascular plants” series. A checklist with all currently accepted genus names in Caryophyllales, as well as nomenclatural references, type names and synonymy is presented. Notes indicate how extensively the respective genera have been studied in a phylogenetic context. The most diverse families at the generic level are Cactaceae and Aizoaceae, but 28 families comprise only one to six genera. This synopsis represents a first step towards the aim of creating a global synthesis of the species diversity in the angiosperm order Caryophyllales integrating the work of numerous specialists around the world

A very high level language for large-grained data flow

A data flow language above the level of a traditional high level language is presented for the purpose of b adapting programs written in a conventional programming language to a parallel enhment A program written in EASY-FLOW is a set of subprogram calls as units, structllfed by iteration, branching, and distribution constructs. The sequencing of execution within these structures is dictated by the data dependencies between units